Perturbed Basins of Attraction

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perturbed Basins of Attraction

Let F be an automorphism of C which has an attracting fixed point. It is well known that the basin of attraction is biholomorphically equivalent to C. We will show that the basin of attraction of a sequence of automorphisms f1, f2, . . . is also biholomorphic to C if every fn is a small perturbation of the original map F .

متن کامل

Basins of Attraction and Perturbed Numerical Solutions using Euler’s Method

Any physical system corresponding to a two-dimensional vector field has some uncertainty in the true flow at any given point; this uncertainty may even vary in time. Analytic study of a dynamical system often shows that a given point is in the basin of attraction of an asymptotically stable fixed point, but uncertainty in the vector field may change the fixed point to which a trajectory is attr...

متن کامل

Partition of networks into basins of attraction.

We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing. A node that has no neighbors of higher degree is a peak, attracting all the nodes in its basin. Maximally random scale-free networks exhibit different behavi...

متن کامل

Classifying and quantifying basins of attraction.

A scheme is proposed to classify the basins for attractors of dynamical systems in arbitrary dimensions. There are four basic classes depending on their size and extent, and each class can be further quantified to facilitate comparisons. The calculation uses a Monte Carlo method and is applied to numerous common dissipative chaotic maps and flows in various dimensions.

متن کامل

Newton's method's basins of attraction revisited

In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in the simple algorithm the presence and the position of the convergent regions, i.e. regions where the method converges nicely to a root, can be complicatedly a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Annalen

سال: 2006

ISSN: 0025-5831,1432-1807

DOI: 10.1007/s00208-005-0739-y